

// 判断链表求交点
function getIntersectionNode(headA, headB) {
    while (headA) {
        headA.tag = true;
        headA = headA.next
    }
    while (headB) {
        if (headB.tag) return true;
        headB = headB.next
    }
    return null
}